package sol.leetcode;

import def.ListNode;
import def.TreeNode;

/**
 * Maximum Depth of Binary Tree
 * Created by lkk on 2016/8/28.
 */
public class Issue104 {
    public static int maxDepth(TreeNode root) {
        if (root==null)
            return 0;
        return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));
    }
}
